Existence of resolvable optimal strong partially balanced designs

Resolvable partially pairwise balanced designs and their applications in computer experiments ∗

The uniform design is one of major designs in computer experiments. In this paper, we develop the connection among the computer experiments, uniform designs in statistics and resolvable partially pairwise balanced designs (RPPBDs) from design theory. A series of RPPBDs with special requirements are constructed and used to produce new uniform designs under the discrete discrepancy.

Optimal resolvable designs with minimum PV aberration

Amongst resolvable incomplete block designs, affine resolvable designs are optimal in many conventional senses. However, different affine resolvable designs for the same numbers of treatments, replicates, and block size can differ in how well they estimate elementary treatment contrasts. An aberration criterion is employed to distinguish the best of the affine resolvable designs for this task. ...

The existence of resolvable Mendelsohn designs RMD({3, s*}, v)

Uniformly resolvable pairwise balanced designs with blocksizes two and three

A uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks can be resolved into parallel classes in such a way that all blocks in a given parallel class have the same size. We are concerned here with designs in which each block has size two or three, and we prove that the obvious necessary conditions on the existence of such designs are also sufficient, with two ...

The existence of court balanced tournament designs

Let V be a set of n elements. A tournament design, TD(n, c), is a c-row array of the (“2) pairs of elements from V such that every element appears at most once is each column. A court balanced tournament design, CBTD(n,c), has the added property that every element appears the same number of times in each row. We show that CBTD(n,c) exist for all n and c satisfying cl(;) and c( n 1 and discuss t...